Graded Sparse Graphs and Matroids
نویسندگان
چکیده
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures. We define a new family called graded sparse graphs, arising from generically pinned bar-and-joint frameworks, and prove that they also form matroids. We also address several algorithmic problems on graded sparse graphs: Decision, Spanning, Extraction, Components, Optimization, and Extension. We sketch variations on pebble game algorithms to solve them.
منابع مشابه
Structural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملOn the Number of Matroids Compared to the Number of Sparse Paving Matroids
It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that limn→∞ sn/mn = 1, where mn denotes the number of matroids on n elements, and sn the number of sparse paving matroids. In this paper, we show that lim n→∞ log sn logmn = 1. We prove this by arguing that each matroid on n elements has a faithful description consisti...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملCount Matroids of Group - Labeled Graphs ∗
A graph G = (V,E) is called (k, `)-sparse if |F | ≤ k|V (F )| − ` for any nonempty F ⊆ E, where V (F ) denotes the set of vertices incident to F . It is known that the family of the edge sets of (k, `)-sparse subgraphs forms the family of independent sets of a matroid, called the (k, `)-count matroid of G. In this paper we shall investigate lifts of the (k, `)-count matroids by using group labe...
متن کاملFirst order convergence of matroids
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the BenjaminiSchramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling. We establish the matroid counterpart of this resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 13 شماره
صفحات -
تاریخ انتشار 2007